Data Mining Approaches for the Methods to Minimize Total Tardiness in Parallel Machine Scheduling Problem
نویسندگان
چکیده
منابع مشابه
A Novel B and B Algorithm for a Unrelated Parallel Machine Scheduling Problem to Minimize the Total Weighted Tardiness
This paper presents a scheduling problem with unrelated parallel machines and sequencedependent setup times that minimizes the total weighted tardiness. A new branch-and-bound (B and B) algorithm is designed incorporating the lower and upper bounding schemes and several dominance properties. The lower and upper bounds are derived through an assignment problem and the composite dispatching rule ...
متن کاملScheduling rules to minimize total tardiness in a parallel machine problem with setup and calendar constraints
Quality control lead times are one of most significant causes of loss of time in the pharmaceutical and cosmetics industries. This is partly due to the organization of laboratories that feature parallel multipurpose machines for chromatographic analyses. The testing process requires long setup times and operators are needed to launch the process. The various controls are non-preemptive and are ...
متن کاملSingle Machine Group Scheduling with Setups to Minimize Total Tardiness
This paper considers the single machine scheduling problem with independent family (group) setup times where jobs in each family are processed together. A sequence independent setup is required to process a job from a different family. The objective is to minimize total tardiness. A mixed integer programming model capable of solving small sized problems is described. Several heuristic algorithm...
متن کاملScheduling on parallel identical machines to minimize total tardiness
This paper focuses on the problem of scheduling n independent jobs on m identical parallel machines for the objective of minimizing total tardiness of the jobs. We develop dominance properties and lower bounds, and develop a branch and bound algorithm using these properties and lower bounds as well as upper bounds obtained from a heuristic algorithm. Computational experiments are performed on r...
متن کاملParallel-machine scheduling to minimize tardiness penalty and power cost
0360-8352/$ see front matter 2012 Elsevier Ltd. A http://dx.doi.org/10.1016/j.cie.2012.10.002 q This manuscript was processed by Area Editor T.C ⇑ Corresponding author. Tel.: +886 3 5131472; fax: E-mail addresses: [email protected] (K.-T. Fan (B.M.T. Lin). Traditional research on machine scheduling focuses on job allocation and sequencing to optimize certain objective functions that are defin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC-PapersOnLine
سال: 2016
ISSN: 2405-8963
DOI: 10.1016/j.ifacol.2016.07.645